Interpolation and Amalgamation for Arrays with MaxDiff

نویسندگان

چکیده

Abstract In this paper, the theory of McCarthy’s extensional arrays enriched with a maxdiff operation (this returns biggest index where two given differ) is proposed. It known from literature that diff required for in order to enjoy Craig interpolation property at quantifier-free level. However, introduced merely instrumental purpose and has only purely formal meaning (it obtained Skolemization extensionality axiom). Our significantly increases level expressivity; however, obtaining results resulting becomes surprisingly hard task. We obtain such via thorough semantic analysis models their amalgamation properties. The are modular respect it shown how convert them into concrete algorithms hierarchical approach.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Amalgamation and Interpolation in Ordered Algebras

The first part of this paper provides a comprehensive and self-contained account of the interrelationships between algebraic properties of varieties and properties of their free algebras and equational consequence relations. In particular, proofs are given of known equivalences between the amalgamation property and the Robinson property, the congruence extension property and the extension prope...

متن کامل

Amalgamation properties and interpolation theorems for equational theories

DEFINITION 0.1. Let Fx, F2, F be subsets of a boolean algebra B. Then the (F1, F2, F)-Separation Principle, written Sep(F~, F2, F) for short, is the following: whenever aEF1, bEF2 and a ^ b = O , there is c~F with a<.c and cAb=O. The (F1, F2, F)-Interpolation Principle, written Int(Ft , F2, F) for short, is the following: whenever a~F1, b~F2 and a<.b there is ceF such that a<~c<~b. Clearly Int ...

متن کامل

Amalgamation and Interpolation in the Category of Heyting Algebras

This is the first of two papers describing how properties of open continuous maps between locales (which are the lattice-theoretic generalisation of topological spaces) can be used to give very straight-forward, constructive proofs of certain properties of first-order intuitionistic theories. The properties we have in mind are those of stability of a conservative interpretation of theories unde...

متن کامل

Program Verification via Craig Interpolation for Presburger Arithmetic with Arrays

Craig interpolation has become a versatile tool in formal verification, in particular for generating intermediate assertions in safety analysis and model checking. In this paper, we present a novel interpolation procedure for the theory of arrays, extending an interpolating calculus for the full theory of quantifier-free Presburger arithmetic, which will be presented at IJCAR this year. We inve...

متن کامل

Intertwining unisolvent arrays for multivariate Lagrange interpolation

Let Pd(C ) denote the space of polynomials of degree at most d in n complex variables. A subset X of C – we will usually speak of configuration or array – is said to be unisolvent for Pd(C ) (or simply unisolvent of degree d) if, for every function f defined on X there exists a unique polynomial P ∈ Pd(C ) such that P(x) = f (x) for every x ∈ X. This polynomial is called the Lagrange interpolat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-71995-1_14